EE 228 a - Lecture 9 - Spring 2006 Complexity and Routing
نویسندگان
چکیده
Two fundamental problems scheduling and routing present themselves in the networking field. Although some ”easy” routing algorithms based upon single constraint optimization exist, we will see that routing with multiple constraints becomes computationally difficult. In order to quantify their intractability, a brief overview of complexity theory will first be presented and then applied to routing algorithms. Issues surrounding optical routing and QoS-aware routing conclude the lecture.
منابع مشابه
EE 228 a - Lecture - Spring 2006
We have, by now, seen the various uses of game theory in different aspects of networking like bandwidth trading, MAC Layer access, congestion control, etc. In this lecture, we will see how routing is modeled using game theory.
متن کاملEE 228 a - Lecture 3 - Spring 2006 Moving Forward
This lecture surveys several research areas in communication networking research. First, we covered an example of proposals to change the routing topology of the internet away from shortest path routing to reduce congestion bottlenecks. Then, we covered issues when networking under different types of environments and with different types of constraints/requirements: mobile networking, network s...
متن کاملEE 228 a - Lecture 8 - Spring 2006
In this lecture, we investigate several scheduling policies for generalized communication networks. The goal is to maximize the network throughput under certain communication constraints. The network is modeled by a set of interconnected and interdependent queueing processes, and the constraints are specified in a service rate matrix. We show two scheduling policies that are optimal in some tec...
متن کاملEE 228 a - Lecture 21 - Spring 2006 Auctions and VCG Allocation
In this lecture, we study several types of auctions, and we introduce the Envelope Theorem (E.T.) to analyze the payoffs for the auctions. The expected payoff in each case is found to be the expectation of the second highest valuation. The VickreyClarke-Grove (VCG) allocation mechanism is used in a generalized scenario of the auctions, and it produces a dominant strategy with the resulting Nash...
متن کاملEE 228 a - Lecture 15 - Spring 2006 Transport in Ad Hoc
There have been an exploding number of wireless application ideas, such as sensor networks. Wireless networks present unique challenges to the designers. For example, wireless channels are intrinsically unreliable due to multi-path fading. Another constraint is limited spectrum resource. Various approaches have been proposed to build scalable efficient wireless networks. Cross layer design seek...
متن کامل